Planning Parallel Actions
نویسندگان
چکیده
This paper presents an integrated view of a wide range of planning systems derived from different theoretical foundations. The work is motivated by the need to provide a clear foundation from which a systematic study of search and representation issues in planning can be conducted. An evolutionary path is identified which shows how the classical (state-based) planning strategy can be incrementally refined into strategies capable of generating parallel plans. This is achieved by considering a succession of planning strategies having a progressively deeper involvement with interval-based representations. Each strategy is defined in terms of a plan representation, truth criterion and an example plan generation procedure which maps out a clearly specified search graph. The capabilities and limitations of each strategy are compared. This approach enables much of the wisdom embedded in existing planners based on the specified strategies to be distilled and unified. The succession of planning strategies identified in this paper define a framework within which fundamental design issues can be considered such as the level of commitment a constraint-posting planner should make during its search for a solution. The framework also highlights the need for practical planners to prevent synergistic interference between parallel actions in an efficient manner. _________________________ * The research described in this paper was conducted at the Centre for Planning and Resource Control (IC-Parc), Imperial College, London, UK. We would like to thank Amin El-Kholy and Hojin Choi for many hours of fruitful discussion which helped shape some of the ideas in this paper. We also want to thank the reviewers for their comments on an earlier draft. The support of GEC-Marconi Limited, the Engineering and Physical Sciences Research Council (EPSRC) and Symbolics Limited is gratefully acknowledged. Accepted for publication in the Journal of Artificial Intelligence.
منابع مشابه
SAT-Based Parallel Planning Using a Split Representation of Actions
Planning based on propositional SAT(isfiability) is a powerful approach to computing step-optimal plans given a parallel execution semantics. In this setting: (i) a solution plan must be minimal in the number of plan steps required, and (ii) non-conflicting actions can be executed instantaneously in parallel at a plan step. Underlying SAT-based approaches is the invocation of a decision procedu...
متن کاملGenerating Parallel Plans Based on Planning Graph Analysis of Predicate/Transition Nets
Multi-agent systems often exhibit rich parallelism among agents. It is desirable in a multi-agent planner to explicitly represent parallel actions. This paper presents an approach for generating parallel execution plans based on the planning graph analysis. Instead of representing a planning problem by STRIPS operators, we model multi-agent planning domains using Predicate/Transition (PrT) nets...
متن کاملParallel Scheduling of Planning and Action of a Mobile Robot Based on Planning-Action Consistency
This paper proposes a novel method to schedule parallel execution of planning and action of a mobile robot. The method considers the following two types of parallelism. (1) acting while planning: if a partial planning result can be used to determine feasible actions, such actions can be executed while the planning process is still going. (2) planning while acting: if the result of the current a...
متن کاملA Novel Constraint Model for Parallel Planning
A parallel plan is a sequence of sets of actions such that any ordering of actions in the sets gives a traditional sequential plan. Parallel planning was popularized by the Graphplan algorithm and it is one of the key components of successful SAT-based planers. SAT-based planners have recently begun to exploit multi-valued state variables – an area which seems traditionally more suited for cons...
متن کاملSatisfiability Planning with Constraints on the Number of Actions
We investigate satisfiability planning with restrictions on the number of actions in a plan. Earlier work has considered encodings of sequential plans for which a plan with the minimal number of time steps also has the minimum number of actions, and parallel (partially ordered) plans in which the number of actions may be much higher than the number of time steps. For a given problem instance fi...
متن کاملParallelizing Planning and Action of a Mobile Robot Based on Planning-Action Consistency
This paper proposes a novel method to schedule parallel execution of planning and action of a mobile robot. The method considers the following two types of parallelism. (1) acting while planning: if a partial planning result can be used to determine feasible actions, such actions can be executed while the planning process is still going. (2) planning while acting: if the result of the current a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Artif. Intell.
دوره 99 شماره
صفحات -
تاریخ انتشار 1998